Optimal Bidding for Mobile-Ad Campaigns

نویسندگان

  • Manmohan Aseri
  • Milind Dawande
  • Ganesh Janakiraman
  • Vijay S. Mookerjee
چکیده

Self-service advertising platforms such as Cidewalk enable advertisers to directly launch their individual mobile advertising campaigns. These platforms contract with advertisers to provide a certain number of impressions on mobile apps in a specific geographic location (usually a town or a zip code) within a fixed time period (usually a day); this is referred to as a campaign. To meet the commitment for a campaign, the platform bids on an ad-exchange to win the required number of impressions from the desired area within the time period of the campaign. We address the platform’s problem of deciding its bidding policy to minimize the expected cost in fulfilling the campaign.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic bidding strategies in search-based advertising

Search-based advertising allows the advertisers to run special campaigns targeted to different groups of potential consumers at low costs. Google, Yahoo and Microsoft advertising programs allow the advertisers to bid for an ad position on the result page of a user when the user searches for a keyword that the advertiser relates to its products or services. The expected revenue generated by the ...

متن کامل

Bid Optimization in Broad-Match Ad Auctions

Ad auctions in sponsored search support “broad match” that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expressiveness to advertisers, this feature makes it challenging to optimize bids to maximize their returns: choosing to bid on a query as a broad match because it provides high profit results in one bidding for related que...

متن کامل

Concise Bid Optimization Strategies with Multiple Budget Constraints

A major challenge faced by marketers attempting to optimize their advertising campaigns is to deal with budget constraints. The problem is even harder in the face of multidimensional budget constraints, particularly in the presence of many decision variables involved and the interplay among the decision variables through such constraints. Concise bidding strategies help advertisers deal with th...

متن کامل

Creating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks

Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...

متن کامل

Creating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks

Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015